This file was created with JabRef 2.2.
Encoding: GBK

@INPROCEEDINGS{Daw89,
  author = {Robin W. Dawes},
  title = {Minimum Odd Neighbourhood Covers for Trees},
  booktitle = {Great Lakes Computer Science Conference},
  year = {1989},
  editor = {Naveed A. Sherwani and Elise de Doncker and John A. Kapenga},
  volume = {507},
  series = {Lecture Notes in Computer Science},
  pages = {161--169},
  publisher = {Springer},
  bibdate = {2002-03-01},
  bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/glakes/glakes1989.html#Dawes89},
  crossref = {conf/glakes/1989},
  isbn = {3-540-97628-0}
}

@ARTICLE{AmS96,
  author = {A. T. Amin and Peter J. Slater},
  title = {All parity realizable trees},
  journal = {J. Combin. Math. Combin. Comput},
  year = {1996},
  volume = {20},
  pages = {53--63}
}

@ARTICLE{AmS92,
  author = {A. T. Amin and Peter J. Slater},
  title = {Neighborhood domination with parity restrictions in graphs},
  journal = {Congressus Numerantium},
  year = {1992},
  volume = {91},
  pages = {19--30}
}

@ARTICLE{ArL96,
  author = {Arora, S. and Lund, C.},
  title = {{Hardness of approximations}},
  journal = {Approximation algorithms for NP-hard problems},
  year = {1996},
  pages = {399--446},
  publisher = {PWS Publishing Co. Boston, MA, USA}
}

@MISC{Ary02,
  author = {Sunil Arya and Siu-Wing Cheng and Rudolf Fleischer and Mordecai Golin
	and Torleiv Klove and Stefan Langermann and Leung Yiu Cho and Hyeon-Suk
	Na and Poon Sheung Hung and Gerhard Trippen and Tsui Ho Man and Antoine
	Vignerson and Joseph Zhou Zhen},
  title = {Fiver},
  year = {2002}
}

@ARTICLE{BaR96,
  author = {Rana Barua and S. Ramakrishnan},
  title = {{$\sigma$}-game, {$\sigma^+$}-game and two-dimensional additive cellular
	automata},
  journal = {Theoretical Computer Science},
  year = {1996},
  volume = {154},
  pages = {349--366},
  number = {2},
  month = {5~} # feb,
  note = {Mathematical Games}
}

@ARTICLE{BMT78,
  author = {Berlekamp and McEliece and van Tilborg},
  title = {On the Inherent Intractability of Certain Coding Problems},
  journal = {IEEETIT: IEEE Transactions on Information Theory},
  year = {1978},
  volume = {24}
}

@ARTICLE{Car96,
  author = {Yair Caro},
  title = {Simple proofs to three parity theorems},
  journal = {Ars Comb},
  year = {1996},
  volume = {42},
  bibdate = {2004-01-20},
  bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/arscom/arscom42.html#Caro96}
}

@ARTICLE{CLW04,
  author = {William Y. C. Chen and Xueliang Li and Chao Wang and Xiaoyan Zhang},
  title = {The Minimum All-Ones Problem for Trees},
  journal = {SIAM Journal on Computing},
  year = {2004},
  volume = {33},
  pages = {379--392},
  number = {2},
  month = apr,
  acknowledgement = {Nelson H. F. Beebe, University of Utah, Department of Mathematics,
	110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA,
	Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|,
	\path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL:
	\path|http://www.math.utah.edu/~beebe/|},
  bibdate = {Sat Apr 16 10:19:19 MDT 2005},
  bibsource = {http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/33/2},
  coden = {SMJCAT},
  doi = {http://dx.doi.org/10.1137/S0097539703421620},
  doi-url = {http://dx.doi.org/10.1137/S0097539703421620},
  issn = {0097-5397 (print), 1095-7111 (electronic)},
  url = {http://epubs.siam.org/sam-bin/dbq/article/42162}
}

@article{chen2004lta,
  title={{Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs}},
  author={Chen, W.Y.C. and Li, X. and Wang, C. and Zhang, X.},
  journal={Electronic Notes in Discrete Math},
  volume={17},
  pages={93--98},
  year={2004}
}

@ARTICLE{CFF99,
  author = {Margaret M. Conlon and Maria Falidas and Mary Jane Forde and John
	W. Kennedy and Susan Mcllwaine and Joseph Stern},
  title = {Inversion Numbers of Graphs},
  journal = {Graph Theory Notes of New York},
  year = {1999},
  volume = {37},
  pages = {42--48}
}

@ARTICLE{CHK99,
  author = {Robert Cowen and Stephen H. Hechier and John W. Kennedy and Alex
	Ryba},
  title = {Inversion and Neighborhood Inversion in Graphs},
  journal = {Graph Theory Notes of New York},
  year = {1999},
  volume = {37},
  pages = {37--41}
}

@INPROCEEDINGS{DoW01,
  author = {Yevgeniy Dodis and Peter Winkler},
  title = {Universal Configurations in {Light-Flipping} Games},
  booktitle = {Proceedings of the Twelfth Annual {ACM}-{SIAM} Symposium on Discrete
	Algorithms ({SODA}-01)},
  year = {2001},
  pages = {926--927},
  address = {New York},
  month = jan # { ~7--9},
  publisher = {ACM Press}
}

@ARTICLE{EES04,
  author = {Henrik Eriksson and Kimmo Eriksson and Jonas Sjostrand},
  title = {Note on the lamp lighting problem},
  journal = {Advances of Applied Mathematics},
  year = {2004},
  volume = {27},
  pages = {357--366},
  month = nov # {~09},
  note = {Comment: 10 pages},
  bibsource = {OAI-PMH server at arXiv.org},
  identifier = {Advances of Applied Mathematics 27, 2001, pages 357-366},
  oai = {oai:arXiv.org:math/0411201},
  subject = {Combinatorics; 05C50; 05B45, 52C20, 11C20, 15A36, 68Q80},
  url = {http://arxiv.org/abs/math/0411201}
}





@article{Gol00,
  title={{Maximization Versions of" Lights Out" Games in Grids and Graphs}},
  author={Goldwasser, J. and Klostermeyer, W.},
  journal={Congressus Numerantium},
  volume={126},
  pages={99--111},
  year={1997}
}

@article{GoK97,
  author = {Goldwasser, J. and Klostermeyer, W. and Trapp, G.},
  title = {{Characterizing Switch-Setting Problems}},
  year = {1997},
  journal = {Linear and Multilinear Algebra},
  number = {1-3},
  pages = {121--136},
  volume = {43}
}

@article{GKZ95,
  title={{Setting Switches on a Grid}},
  author={Goldwasser, J. and Klostermeyer, W. and Trapp, G. and Zhang, CQ},
  year={1995},
  journal={Technical Report from Department of Statistics and Computer Science, WVU},
  volume={20},
  publisher={Technical Report 95-20 from Department of Statistics and Computer Science, WVU, June 1995}
}



@ARTICLE{GKW02,
  author = {John L. Goldwasser and William Klostermeyer and Henry Ware},
  title = {Fibonacci Polynomials and Parity Domination in Grid Graphs},
  journal = {Graphs and Combinatorics},
  year = {2002},
  volume = {18},
  pages = {271--283},
  number = {2},
  bibdate = {2006-11-24},
  bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/gc/gc18.html#GoldwasserKW02},
  url = {http://dx.doi.org/10.1007/s003730200020}
}

@article{Klo01,
  title={{Lights Out!: A Survey of Parity Domination in Grid Graphs}},
  author={Klostermeyer, W.},
  journal={Mathematical Intelligencer},
  volume={11},
  number={2},
  pages={49--53}
}

@ARTICLE{McL84,
  author = {Aileen M. McLoughlin},
  title = {The complexity of computing the covering radius of a code},
  journal = {IEEE Transactions on Information Theory},
  year = {1984},
  volume = {30},
  pages = {800--804},
  number = {6},
  bibdate = {2005-03-09},
  bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/tit/tit30.html#McLoughlin84}
}

@INPROCEEDINGS{Pap01,
  author = {Christos H. Papadimitriou},
  title = {Algorithms, Games, and the {I}nternet},
  booktitle = {Proceedings of the 33rd Annual ACM Symposium on Theory of Computing},
  year = {2001},
  address = {Crete, Greece},
  month = {July}
}

@ARTICLE{Sav70,
  author = {Walter J. Savitch},
  title = {Relationships between nondeterministic and deterministic tape complexities},
  journal = {Journal of Computer and System Sciences},
  year = {1970},
  volume = {4},
  pages = {177--192},
  number = {2}
}

@ARTICLE{Sut00,
  title={{$\sigma$-Automata and Chebyshev-polynomials}},
  author={Klaus Sutner},
  journal={Theoretical computer science},
  volume={230},
  number={1-2},
  pages={49--73},
  year={2000},
  publisher={Elsevier}
}

@ARTICLE{Sut90,
  author = {Klaus Sutner},
  title = {{The $\sigma$-Game and Cellular Automata}},
  journal = {The American Mathematical Monthly},
  year = {1990},
  volume = {97},
  pages = {24--34},
  number = {1},
  publisher = {JSTOR}
}

@ARTICLE{Sut89,
  author = {Klaus Sutner},
  title = {Linear Cellular Automata and the Garden-of-Eden},
  journal = {The mathematical intelligencer.},
  year = {1989},
  volume = {11},
  pages = {49},
  number = {2}
}

@ARTICLE{Sut88,
  author = {Klaus Sutner},
  title = {Additive Automata on Graphs},
  journal = {Complex Systems},
  year = {1988},
  volume = {2},
  pages = {649--661},
  number = {6},
  month = dec,
  key = {Sutner},
  location = {CMU E\&{}S Library}
}


@PhdThesis{Val78,
  author =	"J. Valdes",
  title =	"Parsing Flowcharts and Series-Parallel Graphs",
  school =	"Stanford University",
  type = 	"Ph.{D}. Dissertation",
  number =	"NTIS AD-A/65265",
  address =	"Stanford",
  year = 	"1978",
  keywords =	"RBBRS2272,",
}

@ARTICLE{VTL82,
  author = {Valdes, J. and Tarjan, R.E. and Lawler, E.L.},
  title = {{The Recognition of Series Parallel Digraphs}},
  journal = {SIAM Journal on Computing},
  year = {1982},
  volume = {11},
  pages = {298},
  publisher = {SIAM}
}

@ARTICLE{Var97,
  author = {Alexander Vardy},
  title = {The intractability of computing the minimum distance of a code},
  journal = {IEEE Transactions on Information Theory},
  year = {1997},
  volume = {43},
  pages = {1757--1766},
  number = {6},
  bibdate = {2004-09-24},
  bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/tit/tit43.html#Vardy97}
}



@article{VrV01,
  title={{Combinatorial Auctions: A Survey}},
  author={de Vries, S. and Vohra, R.V.},
  journal={INFORMS Journal on Computing},
  volume={15},
  number={3},
  pages={284--309},
  year={2003}
}



@misc{WaW07,
  author = {Xinmao Wang and Yaokun Wu},
  title = {$\sigma$-game on trees: covering radius and tree order},
  year = {2007}
}

@article{delahan1995aws,
  title={{Another way to solve nine-tails}},
  author={Delahan, F. and Klostermeyer, W.F. and Trapp, G.},
  journal={ACM SIGCSE Bulletin},
  volume={27},
  number={4},
  pages={27--28},
  year={1995},
  publisher={ACM Press New York, NY, USA}
}

@article{heck1994dpp,
  title={{Dynamic programming for pennies a day}},
  author={Heck, P.},
  journal={Proceedings of the twenty-fifth SIGCSE symposium on Computer science education},
  pages={213--217},
  year={1994},
  publisher={ACM Press New York, NY, USA}
}

@article{pelletier1987msm,
  title={{Merlin's magic square}},
  author={Pelletier, D.H.},
  journal={American Mathematical Monthly},
  volume={94},
  number={2},
  pages={143--150},
  year={1987},
  publisher={Mathematical Association of America Washington, DC, USA}
}

@article{amin2002pdg,
  title={{Parity Dimension for Graphs-A Linear Algebraic Approach}},
  author={Amin, A.T. and Slater, P.J. and Zhang, G.H.},
  journal={Linear and Multilinear Algebra},
  volume={50},
  number={4},
  pages={327--342},
  year={2002},
  publisher={Taylor \& Francis}
}

@article{downey29pcs,
  title={{The Parametrized Complexity of Some Fundamental Problems in Coding Theory}},
  author={Downey, R.G. and Fellows, M.R. and Vardy, A. and Whittle, G.},
  journal={SIAM Journal on Computing},
  volume={29},
  number={2},
  pages={545--570}
}

@article{fraenkel2002tpg,
  title={{Two-player games on cellular automata}},
  author={Fraenkel, A.S.},
  journal={More Games of No Chance},
  pages={279--306},
  year={2002}
}

@article{sutner2001dac,
  title={{Decomposition of additive cellular automata}},
  author={Sutner, K.},
  journal={Complex Systems},
  volume={13},
  number={3},
  pages={245--270},
  year={2001}
}

@article{lee2006laa,
  title={{LINEAR ALGEBRAIC APPROACH ON REAL $\sigma$-GAME}},
  author={LEE, S.G. and YANG, J.M.},
  journal={J. Appl. Math. \& Computing Vol},
  volume={21},
  number={1-2},
  pages={295--305},
  year={2006}
}

@article{chin2001lca,
  title={{Linear cellular automata with boundary conditions}},
  author={Chin, W. and Cortzen, B. and Goldman, J.},
  journal={Linear Algebra and Its Applications},
  volume={322},
  number={1-3},
  pages={193--206},
  year={2001},
  publisher={Elsevier}
}

@article{gravier2003mdg,
  title={{On a modular domination game}},
  author={Gravier, S. and Mhalla, M. and Tannier, E.},
  journal={Theoretical Computer Science},
  volume={306},
  pages={291--303},
  year={2003}
}

@article{hunziker2004cpo,
  title={{Chebyshev polynomials over finite fields and reversibility of $\sigma$-automata on square grids}},
  author={Hunziker, M. and Machiavelo, A. and Park, J.},
  journal={Theoretical Computer Science},
  volume={320},
  number={2-3},
  pages={465--483},
  year={2004},
  publisher={Elsevier Science Publishers Ltd. Essex, UK}
}

@article{sarkar1998msigmaa,
  title={{Multidimensional $\sigma$-automata, $\pi$-polynomials and generalised S-matrices}},
  author={SARKAR, P. and BARUA, R.},
  journal={Theoretical computer science},
  volume={197},
  number={1-2},
  pages={111--138},
  year={1998},
  publisher={Elsevier}
}

@article{tollisen2000csg,
  title={{Color switching games}},
  author={Tollisen, G.P. and Lengyel, T.},
  journal={Ars Combin},
  volume={56},
  pages={223--234},
  year={2000}
}

@article{WaW07TCS,
  title={{Minimum light number of lit-only $\sigma$-game on a tree}},
  author={Xinmao Wang and Yaokun Wu},
  journal={Theoretical Computer Science},
  year={2007},
  doi={doi:10.1016/j.tcs.2007.05.033},
  publisher={Elsevier},
}